Exponential forgetting of smoothing distributions for pairwise Markov models

نویسندگان

چکیده

We consider a bivariate Markov chain Z={Zk}k≥1={(Xk,Yk)}k≥1 taking values on product space Z=X×Y, where X is possibly uncountable and Y={1,…,|Y|} finite state-space. The purpose of the paper to find sufficient conditions that guarantee exponential convergence smoothing, filtering predictive probabilities: supn≥t‖P(Yt:∞∈⋅|Xl:n)−P(Yt:∞∈⋅|Xs:n)‖TV≤Ksαt,a.s. Here t≥s≥l≥1, Ks σ(Xs:∞)-measurable random variable α∈(0,1) fixed. In second part paper, we establish two-sided versions above-mentioned convergence. show desired convergences hold under fairly general conditions. A special case very model popular hidden (HMM). prove in HMM-case, our assumptions are more than all similar mixing-type encountered practice, yet relatively easy verify.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exponential Forgetting and Geometric Ergodicity in Hidden Markov Models

We consider a hidden Markov model with multidimensional observations, and with misspecification, i.e. the assumed coefficients (transition probability matrix, and observation conditional densities) are possibly different from the true coefficients. Under mild assumptions on the coefficients of both the true and the assumed models, we prove that : (i) the prediction filter forgets almost surely ...

متن کامل

Exponential Forgetting and Geometric Ergodicityin Hidden Markov

We consider a hidden Markov model with multidimen-sional observations, and with misspeciication, i.e. the assumed coeecients (transition probability matrix, and observation conditional densities) are possibly diier-ent from the true coeecients. Under mild assumptions on the coeecients of both the true and the assumed models, we prove that : (i) the prediction lter forgets almost surely its init...

متن کامل

A Multiscale Smoothing Algorithm for Pairwise Markov Trees

An important problem in multiresolution analysis of signals and images consists in restoring continuous hidden random variables x = {xs}s∈S from observed ones y = {ys}s∈S . This is done classically in the context of Hidden Markov Trees (HMT). HMT have been generalized recently to Pairwise Markov Trees (PMT). In this paper we propose a smoothing restoration algorithm for Gaussian PMT.

متن کامل

Prediction of global sea cucumber capture production based on the exponential smoothing and ARIMA models

Sea cucumber catch has followed “boom-and-bust” patterns over the period of 60 years from 1950-2010, and sea cucumber fisheries have had important ecological, economic and societal roles. However, sea cucumber fisheries have not been explored systematically, especially in terms of catch change trends. Sea cucumbers are relatively sedentary species. An attempt was made to explore whether the tim...

متن کامل

Asymptotic smoothing errors for hidden Markov models

In this paper, the asymptotic smoothing error for hidden Markov models (HMMs) is investigated using hypothesis testing ideas. A family of HMMs is studied parametrised by a positive constant , which is a measure of the frequency of change. Thus, when 0, the HMM becomes increasingly slower moving. We show that the smoothing error is ( ). These theoretical predictions are confirmed by a series of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Probability

سال: 2021

ISSN: ['1083-6489']

DOI: https://doi.org/10.1214/21-ejp628